import java.util.Arrays;
import java.util.Random;

public class Test {

    public  static void orderArray(int[] array){
        for (int i = 0; i < array.length; i++) {
            array[i] = array.length-i;
            array[i] = array.length-1-i;
        }
    }

    public static void notOrderArray(int[] array){
        Random random = new Random();
        for (int i = 0; i < array.length; i++) {
            array[i] = random.nextInt(10_0000);
        }
    }

    public static void testInsert(int[] array) {
        array = Arrays.copyOf(array,array.length);
        long startTime = System.currentTimeMillis();
        Sort.insetSort(array);
        long endTime = System.currentTimeMillis();
        System.out.println("直接插入排序耗时："+(endTime-startTime));
    }

    public static void testShellSort(int[] array) {
        array = Arrays.copyOf(array,array.length);
        long startTime = System.currentTimeMillis();
        Sort.shellSort (array);
        long endTime = System.currentTimeMillis();
        System.out.println("希尔排序耗时："+(endTime-startTime));
    }

    public static void testSelectSort(int[] array) {
        array = Arrays.copyOf(array,array.length);
        long startTime = System.currentTimeMillis();
        Sort.selectSort (array);
        long endTime = System.currentTimeMillis();
        System.out.println("选择排序耗时："+(endTime-startTime));
    }

    public static void testHeapSort(int[] array) {
        array = Arrays.copyOf(array,array.length);
        long startTime = System.currentTimeMillis();
        Sort.heapSort (array);
        long endTime = System.currentTimeMillis();
        System.out.println("堆排序耗时："+(endTime-startTime));
    }

    public static void testQuickSort(int[] array) {
        array = Arrays.copyOf(array,array.length);
        long startTime = System.currentTimeMillis();
        Sort.quickSort(array);
        long endTime = System.currentTimeMillis();
        System.out.println("快速排序耗时："+(endTime-startTime));
    }

    public static void testMergeSort(int[] array) {
        array = Arrays.copyOf(array,array.length);
        long startTime = System.currentTimeMillis();
        Sort.mergeSort(array);
        long endTime = System.currentTimeMillis();
        System.out.println("归并排序耗时："+(endTime-startTime));
    }

    /**
     * 测试简单的数据能否执行，测试算法是否正确
     */
    public static void testSimple() {
        int[] array = {9,1,2,5,7,4,8,6,3,5};
        System.out.println("排序前："+Arrays.toString(array));
        Sort.shellSort(array);
        System.out.println("排序后："+Arrays.toString(array));
    }

    public static void testOther() {
        int[] array = new int[10_0000];
        //notOrderArray(array);
        orderArray(array);

        testInsert(array);
        testShellSort(array);
    }

    public static void main(String[] args) {
        testSimple();
        testOther();
    }


}
